Improving Program Locality On - the - fly
نویسندگان
چکیده
viAcknowledgments, ivBibliography, 134
منابع مشابه
Maximizing Loop
Loop fusion is a program transformation that merges multiple loops into one. It is eeective for reducing the synchronization overhead of parallel loops and for improving data locality. This paper presents three results for fusion: (1) a new algorithm for fusing a collection of parallel and sequential loops, minimizing parallel loop synchronization while maximizing parallelism; (2) a proof that ...
متن کاملImproving the Locality of Program Instances by Local Search
In memory hierarchies, programs can be speeded up by increasing their degree of locality. This paper proposes an algorithm that optimizes the locality of program instances. Input is a set of statement instances, where each statement instance is characterized by the sequence of data it accesses. The algorithm orders the statement instances, thereby respecting data dependencies, and groups the da...
متن کاملMaximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution
Loop fusion is a program transformation that merges multiple loops into one. It is eeective for reducing the synchronization overhead of parallel loops and for improving data locality. This paper presents three results for fusion: (1) a new algorithm for fusing a collection of parallel and sequential loops, minimizing parallel loop synchronization while maximizing parallelism; (2) a proof that ...
متن کاملImproving the EÆciency of Memory Partitioning by Address Clustering
Memory partitioning is an e ective approach to memory energy optimization in embedded systems. Spatial locality of the memory address pro le is the key property that partitioning exploits to determine an eÆcient multi-bank memory architecture. This paper presents an approach, called address clustering, for increasing the locality of a given memory access pro le, and thus improving the eÆciency ...
متن کاملDistance-Based Locality Analysis and Prediction
Profiling can accurately analyze program behavior for select data inputs. This article shows that profiling can also predict program locality for inputs other than profiled ones. Here locality is defined by the distance of data reuse. The article describes three distance-based techniques for whole-program locality analysis. The first is approximate measurement of reuse distance in near linear t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006